Sequen es with Low Cross Correlation

Comparing an HMM and an SCFG

1 Baskin Center for Computer S ien e and Engineering, University of California, Santa Cruz, CA 95064, U.S.A. E-mail: {jagota,rlyngsoe} se.u s .edu 2 BRICS⋆ ⋆ ⋆, Department of Computer S ien e, University of Aarhus, Ny Munkegade, DK-8000 Århus C, Denmark. E-mail: storm bri s.dk. Abstra t Sto hasti models are ommonly used in bioinformati s, e.g. hidden Markov models for modeling sequen e families...

Degree Sequen es of Optimally Edge-Conne ted Multigraphs

Let u; v be distin t verti es of a multigraph G with degrees d u and d v , respe tively. The number of edge-disjoint u; v-paths in G is bounded above by minfd u ; d v g. A multigraph G is optimally edgeonne ted if for all pairs of distin t verti es u and v this upper bound is a hieved. If G is a multigraph with degree sequen e D, then we say G is a realisation of D. We hara terize degree sequen...

Dete tion for Symmetri Multi - A ess

List Dete tion for Symmetri Multi-A ess Channels Aaron Reid1, Alex Grant Institute for Tele ommuni ations Resear h University of South Australia Mawson Lakes SA 5095 Australia e-mail: areid spri.levels.unisa.edu.au e-mail: alex.grant unisa.edu.au Paul Alexander Southern Poro Communi ations 6A Nelson Street Annandale NSW 2038 Australia e-mail: palex spri.levels.unisa.edu.au Abstra t | We propose...

The NumbersWithNames Program

We present the NumbersWithNames program whi h performs data-mining on the En y lopedia of Integer Sequen es to nd interesting onje tures in number theory. The program forms onje tures by nding empiri al relationships between a sequen e hosen by the user and those in the En y lopedia. Furthermore, it transforms the hosen sequen e into another set of sequen es about whi h onje tures an also be fo...

Learning High-Degree Sequen es in a Linear Network